# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def numberOfBeams(self, bank: List[str]) -> int:
        bank_row_count = len(bank)
        device_count = len(bank[0])
        ans = 0
        pre_laser_count = -1

        for i in range(bank_row_count):
            row = bank[i]
            row_laser_count = 0
            for j in range(device_count):
                if row[j] == '1':
                    row_laser_count += 1

            if pre_laser_count == -1:
                pre_laser_count = row_laser_count
            elif row_laser_count != 0:
                ans += row_laser_count * pre_laser_count
                pre_laser_count = row_laser_count

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        (["011001", "000000", "010100", "001000"], 8),
        (["000", "111", "000"], 0)
    ]

    for case_item in testcases:
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]
        exec_result = solution.numberOfBeams(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

